Automated Conjecturing I: Fajtlowicz's Dalmatian Heuristic Revisited (Extended Abstract)
نویسندگان
چکیده
This condensed summary highlights the results of a 2016 AIJ paper reporting on a successful generalpurpose conjecturing program.
منابع مشابه
Automated conjecturing I: Fajtlowicz's Dalmatian heuristic revisited
We discuss a new implementation of, and new experiments with, Fajtlowicz’s Dalmatian conjecture-making heuristic. Our program makes conjectures about relations of real number invariants of mathematical objects. Conjectures in matrix theory, number theory, and graph theory are reported, together with an experiment in using conjectures to automate game play. The program can be used in a way that,...
متن کاملAutomated Conjecturing of Frobenius Numbers via Grammatical Evolution
Conjecturing formulas and other symbolic relations occurs frequently in number theory and combinatorics. If we could automate conjecturing, we could benefit not only from faster conjecturing but also from finding conjectures previously out of our grasp. Grammatical evolution, a genetic programming technique, can be used for automated conjecturing in mathematics. Concretely, this work describes ...
متن کاملCase-Analysis for Rippling and Inductive Proof
Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like earlier work, this allows goals containing if-statements to be proved automatically. The new contribution is that our method also supports case-analysis on datatypes. By locating the case-analysis as a step within rippling we a...
متن کاملLandmark-Based Heuristics and Search Control for Automated Planning (Extended Abstract)
Automated planning is the process of automatically selecting actions that achieve a desired outcome. This paper summarises several contributions that improve the e ciency of automated planning via heuristic search. We discuss novel heuristics based on landmarks and a search algorithm for anytime planning. Furthermore, we analyse various searchenhancement techniques and show how the combination ...
متن کاملSearch Methods Revisited
In this chapter, we review the work of automated geometry theorem proving based on heuristic search methods and report some recent advances in this direction, especially the geometry deductive database which shows surprising power in terms of proving and discovering difficult geometry theorems. We also discuss several key issues in developing an efficient geometry theorem prover with heuristic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017